#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

int n, m;
int head[N];
int ver[N << 1], Next[N << 1], tot;
void add(int u, int v) {
  ++tot;
  ver[tot] = v;
  Next[tot] = head[u];
  head[u] = tot;
}
int clr[2];
int o, oe, oo;
int vis[N];
void dfs(int u, int fu, int c) {
  clr[c]++;
  vis[u] = 1;
  for (int i = head[u]; i; i = Next[i]) {
    int v = ver[i];
    if (v == fu || vis[v]) continue;
    dfs(v, u, c ^ 1);
  }
}
bool solve() {
  cin >> n >> m;
  rep(i, 1, m) {
    int u, v;
    cin >> u >> v;
    add(u, v), add(v, u);
  }
  rep(i, 1, n) {
    if (!vis[i]) {
      clr[0] = clr[1] = 0;
      dfs(i, 0, 1);
      if (clr[0] + clr[1] == 1)
        o++;
      else if ((clr[0] & 1) ^ (clr[1] & 1))
        oe++;
      else if (clr[0] & 1)
        oo++;
    }
  }
  if ((n & 1) || oe >= 3) return m & 1;
  if (oe) return true;
  return (o / 2 + oo + m) & 1;
}

int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  if (solve())
    cout << "Aoki";
  else
    cout << "Takahashi";
  return 0;
}